package interview;

public class Leetcode_面试题_0811 {
    public int waysToChange(int n) {
        int[] coins = new int[]{1, 5, 10, 25};
        int[] dp = new int[n + 1];
        dp[0] = 1;
        for (int coin : coins) {
            for (int j = coin; j <= n; j++) {
                dp[j] += dp[j - coin] % 1000000007;
            }
        }
        return dp[n] % 1000000007;
    }

    public static void main(String[] args) {
        Leetcode_面试题_0811 l = new Leetcode_面试题_0811();
        System.out.println(l.waysToChange(900750));
    }
}
